#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#include <list>

#define sf(x) scanf("%d", &x)
#define pf(x) printf("%d ", x)
#define pf2(x,y) printf("%d %d ", x,y)
#define sf2(x,y) scanf("%d %d", &x,&y)
#define sff(x) scanf("%lf", &x)
#define pff(x) printf("%lf ", x)
#define ENDL printf("\n")
#define pfl(x) printf("%I64d ", x)
#define sfl(x) scanf("%I64d", &x)

using namespace std;

typedef long long ll;


int main()
{
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	string s;
	double a;
	bool f1,f2;
	cin>>s;
	while(s!="#")
	{
		int n=1;
		f1=0;
		f2=0;
		int i=s.size()-1;
		if(s[i]=='h')
		{
			f1=true;
			a=0;
			i-=5;
		}
		else
		{
			f2=true;
			a=90;
			i-=4;
		}
		while(i>=0)
		{
			if(s[i]=='h')
			{
				a-=90.0/(1<<n);
				i-=5;
			}
			else
			{
				a+=90.0/(1<<n);
				i-=4;
			}
			n++;
			if(a<0) a=0;
			if(a>90) a=90;
		}
		n=0;
		while((a-(int)a)>0)
		{
			a*=2;
			n++;
		}
		if(a==0||n==0)
		{
			printf("%d\n",(int)a);
		}
		else
		{
			printf("%d/%d\n",(int)a,(1<<n));
		}
		cin>>s;
	}
	return 0;
}


